////#pragma comment(linker,"/STACK:16777216") /*16Mb*/
////#pragma comment(linker,"/STACK:33554432") /*32Mb*/
//#define _CRT_SECURE_NO_DEPRECATE
//#include<iostream>
//#include<numeric>
//#include<sstream>
//#include<cstdio>
//#include<cstdlib>
//#include<cmath>
//#include<memory>
//#include<string>
//#include<vector>
//#include<cctype>
//#include<list>
//#include<queue>
//#include<deque>
//#include<stack>
//#include<map>
//#include<set>
//#include<algorithm>
//using namespace std;
//
//typedef unsigned long long      ui64;
//typedef long long               i64;
//typedef	vector<int>             VI;
//typedef	vector<bool>            VB;
//typedef	vector<VI>              VVI;
//typedef	vector<string>          VS;
//typedef	pair<int,int>           PII;
//typedef map<string,int>         MSI;
//typedef set<int>                SI;
//typedef set<string>             SS;
//typedef map<int,int>            MII;
//typedef	pair<double,double>     PDD;
//
//#define PB                      push_back
//#define MP                      make_pair
//#define X                       first
//#define Y                       second
//#define FOR(i, a, b)            for(int i = (a); i < (b); ++i)
//#define RFOR(i, a, b)           for(int i = (a) - 1; i >= (b); --i)
//#define CLEAR(a, b)             memset(a, b, sizeof(a))
//#define SZ(a)                   int((a).size())
//#define ALL(a)                  (a).begin(), (a).end()
//#define RALL(a)                 (a).rbegin(), (a).rend()
//#define INF                     (2000000000)
//
//int prefix_function (string s) {
//	int n = (int) s.length();
//	vector<int> pi (n);
//	for (int i=1; i<n; ++i) {
//		int j = pi[i-1];
//		while (j > 0 && s[i] != s[j])
//			j = pi[j-1];
//		if (s[i] == s[j])  ++j;
//		pi[i] = j;
//	}
//	int ans = 0;
//	FOR(i,0,SZ(s))
//		ans = max(ans, pi[i]);
//	return ans;
//}
//
//set<char> Sis;
//
//int main()
//{
//	string s;
//	cin >> s;
//	string rs = s;
//	reverse(ALL(rs));
//	FOR(i,0,SZ(s))
//		Sis.insert(s[i]);
//	vector<char> is(ALL(Sis));
//	int ans = 0;
//	int k = SZ(s)+1;
//	FOR(i,0,SZ(s)) {
//		ans += ( prefix_function(s[i]+rs));
//	}
//	ans = SZ(s)*(SZ(s)+1)/2 - ans;
//	cout << ans << endl;
//    return 0;
//}